منابع مشابه
Bounds for the Co-PI index of a graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
متن کاملObtaining Bounds for Ramsey Numbers
There are two equivalent problem statements for the Ramsey number n = R(k; l). n is the minimum number of vertices in the graph such that it contains a complete graph of k vertices, or an independent set of l vertices. n is the minimum number of vertices such that if all the edges of the complete graph on n vertices, denoted by K n is colored with two colors, fRed, Blueg, then there exists a Re...
متن کاملAsymmetrical Ramsey Bounds for Hypercubes
An n-cube is the set of 2 points in n-dimensional Euclidean space and is often denoted by {0, 1}n. It is known that n-cube as a Cartesian product of pair of points is Ramsey, but no asymmetrical results are known. In this work we are concerned with bounds on the necessary dimension n of Euclidean space such that every r-coloring gives us monochromatic hypercube of some color and given dimension...
متن کاملNew lower bounds for hypergraph Ramsey numbers
The Ramsey number rk(s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1, . . . , N}, there are s integers such that every k-tuple among them is red, or n integers such that every k-tuple among them is blue. We prove the following new lower bounds for 4-uniform hypergraph Ramsey numbers: r4(5, n) > 2 n log n and r4(6, n) > 2 2 1/5 , where c is an absolute positive...
متن کاملConstructive Bounds for a Ramsey-Type Problem
For every fixed integers r, s satisfying 2 ≤ r < s there exists some = (r, s) > 0 for which we construct explicitly an infinite family of graphs Hr,s,n, where Hr,s,n has n vertices, contains no clique on s vertices and every subset of at least n1− of its vertices contains a clique of size r. The constructions are based on spectral and geometric techniques, some properties of Finite Geometries a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1971
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1971.37.45